1097A - Gennady and a Card Game - CodeForces Solution

#include<iostream>
#include<bits/stdc++.h>

using namespace std;

#define MOD 1000000007

#define pb push_back
#define forn(i,n) for(int i=0;i<n;i++)
#define all1(x) x.begin(), x.end()
#define all2(x) x.rbegin(), x.rend()
#define pairs pair<int,int>
#define debug(v) for(long long i=0;i<v.size();i++)cout<<v[i]<<" ";cout<<endl;
#define debugP(v) for(long long i=0;i<v.size();i++)cout<<v[i].first<<" "<<v[i].second<<endl;
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define int long long

#define pi 3.14159265358979323846
#define endli "\n";

void init() 
{
    #ifndef ONLINE_JUDGE

        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);

    #endif // ONLINE_JUDGE
}

void solve()
{
   string n;
   cin >> n;

   for (int i = 0; i < 5; i++)
   {
        string s;
        cin >> s;

        if (s[0] == n[0] || s[1] == n[1])
        {
            cout << "YES";
            return;
        }
   }

   cout << "NO" << endli;
   
}

signed main() {
    init();

    int t = 1;
    // cin >> t;

    while(t--)
    {
        solve();
    }    
}